On vertex-induced weighted Turán problems
نویسندگان
چکیده
Recently, Bennett, English and Talanda-Fisher introduced the vertex-induced weighted Turán problem. In this paper, we consider their open problem under sum-edge-weight function characterize extremal structure of K ℓ -free graphs. Based on these results, propose a generalized version Erdős–Stone theorem for graphs two types weight functions.
منابع مشابه
Vertex Turán problems in the hypercube
Let Qn be the n-dimensional hypercube: the graph with vertex set {0, 1} and edges between vertices that differ in exactly one coordinate. For 1 ≤ d ≤ n and F ⊆ {0, 1} we say that S ⊆ {0, 1} is F -free if every embedding i : {0, 1} → {0, 1} satisfies i(F ) 6⊆ S. We consider the question of how large S ⊆ {0, 1} can be if it is F -free. In particular we generalise the main prior result in this are...
متن کاملTurán problems for integer-weighted graphs
A multigraph is (k, r)-dense if every k-set spans at most r edges. What is the maximum number of edges exN(n, k, r) in a (k, r)-dense multigraph on n vertices? We determine the maximum possible weight of such graphs for almost all k and r (e.g., for all r > k) by determining a constant m = m(k, r) and showing that exN(n, k, r) = m ( n 2 ) +O(n), thus giving a generalization of Turán’s theorem. ...
متن کاملSolving Vertex Coloring Problems as Maximum Weighted Stable Set Problems
In Vertex Coloring Problems, one is required to assign a color to each vertex of an undirected graph in such a way that adjacent vertices receive different colors, and the objective is to minimize the cost of the used colors. In this work we solve four different coloring problems formulated as Maximum Weight Stable Set Problems on an associated graph. We exploit the transformation proposed by C...
متن کاملRainbow Turán Problems
For a fixed graph H, we define the rainbow Turán number ex∗(n,H) to be the maximum number of edges in a graph on n vertices that has a proper edge-colouring with no rainbow H. Recall that the (ordinary) Turán number ex(n,H) is the maximum number of edges in a graph on n vertices that does not contain a copy of H. For any non-bipartite H we show that ex∗(n,H) = (1+o(1))ex(n,H), and if H is colou...
متن کاملTurán Problems on Non-Uniform Hypergraphs
A non-uniform hypergraph H = (V,E) consists of a vertex set V and an edge set E ⊆ 2V ; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types. For a fixed hypergraph H, the Turán density π(H) is defined to be limn→∞maxGn hn(Gn), where the maximum is taken over all H-free hypergraphs Gn on n vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112628